On maximum weight of a bipartite graph of given order and size
نویسندگان
چکیده
منابع مشابه
On maximum weight of a bipartite graph of given order and size
The weight of an edge xy of a graph is defined to be the sum of degrees of the vertices x and y. The weight of a graph G is the minimum of weights of edges of G. More than twenty years ago Erdős was interested in finding the maximum weight of a graph with n vertices and m edges. This paper presents a complete solution of a modification of the above problem in which a graph is required to be bip...
متن کاملThe Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices and ∆(G) ≤ r, which has the most complete subgraphs of size t, for t ≥ 3. The conjectured extremal graph is aKr+1 ∪Kb, where n = a(r + 1) + b with 0 ≤ b ≤ r. Gan, Loh, and Sudakov proved the conjecture wh...
متن کاملMaximum order of trees and bipartite graphs with a given rank
The rank of a graph is that of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced trees as well as bipartite graphs with a given rank and characterize those graphs achieving the maximum order.
متن کاملthe effect of explicit teaching of metacognitive vocabulary learning strategies on recall and retention of idioms
چکیده ندارد.
15 صفحه اولlanguage learning strategies and vocabulary size of iranian efl learners
learning a second or foreign language requires the manipulation of four main skills, namely, listening, reading, speaking, and writing which lead to effective communication. it is obvious that vocabulary is an indispensible part of any communication, so without a vocabulary, no meaningful communication can take place and meaningful communication relies heavily on vocabulary. one fundamental fac...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2013
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1674